Solving selected problems on the Chinese remainder theorem

The Chinese Remainder Theorem

On Solving a Generalized Chinese Remainder Theorem in the Presence of Remainder Errors

In estimating frequencies given that the signal waveforms are undersampled multiple times, Xia and his collaborators proposed to use a generalized version of Chinese remainder Theorem (CRT), where the moduli are dm1, dm2, · · · , dmk with m1,m2, · · · ,mk being pairwise coprime. If the errors of the corrupted remainders are within d 4 , their schemes are able to construct an approximation of th...

IP traceback based on chinese remainder theorem

IP traceback is a defense method to help a victim to identifying the sources of attacking packets. In this paper, we propose an IP traceback method based on the Chinese Remainder Theorem to require routers to probabilistically mark packets with partial path information when packets traverse routers through the Internet. The routers with the proposed IP traceback method can interoperate seamless...

PDF Steganography based on Chinese Remainder Theorem

We propose different approaches of PDF files based steganography, essentially based on the Chinese Remainder Theorem. Here, after a cover PDF document has been released from unnecessary characters of ASCII code A0, a secret message is hidden in it using one of the proposed approaches, making it invisible to common PDF readers, and the file is then transmitted through a non-secure communication ...

Network Coding Based on Chinese Remainder Theorem

Random linear network code has to sacrifice part of bandwidth to transfer the coding vectors, thus a head of size k log |T | is appended to each packet. We present a distributed random network coding approach based on the Chinese remainder theorem for general multicast networks. It uses a couple of modulus as the head, thus reduces the size of head to O(log k). This makes it more suitable for s...